Delaunay Triangulations of Degenerate Point Sets
نویسندگان
چکیده
The Delaunay triangulation (DT) is one of the most common and useful triangulations of point sets P in the plane. DT is not unique when P is degenerate, specifically when it contains quadruples of co-circular points. One way to achieve uniqueness is by applying a small (or infinitesimal) perturbation to P . We consider a specific perturbation of such degenerate sets, in which the coordinates of each point are independently perturbed by normally distributed small quantities, and investigate the effect of such perturbations on the DT of the set. We focus on two special configurations, where (1) the points of P form a uniform grid, and (2) the points of P are vertices of a regular polygon. We present interesting (and sometimes surprising) empirical findings and properties of the perturbed DTs for these cases, and give theoretical explanations to some of them.
منابع مشابه
Minimizing local minima in terrains with higher-order Delaunay triangulations
We show that triangulating a set of points with elevations such that the number of local minima of the resulting terrain is minimized is NP-hard for degenerate point sets. The same result applies when there are no degeneracies for higher-order Delaunay triangulations. Two heuristics are presented to minimize the number of local minima for higher-order Delaunay triangulations, and they are compa...
متن کاملGenerating Realistic Terrains with Higher-Order Delaunay Triangulations
For hydrologic applications, terrain models should have few local minima, and drainage lines should coincide with edges. We show that triangulating a set of points with elevations such that the number of local minima of the resulting terrain is minimized is NP-hard for degenerate point sets. The same result applies when there are no degeneracies for higher-order Delaunay triangulations. Two heu...
متن کاملOn Algorithmic Enumeration of Higher-Order Delaunay Triangulations
In the pursuit of realistic terrain models, Gudmundsson, Hammar, and van Kreveld introduced higher-order Delaunay triangulations. A usual Delaunay triangulation is a 0order Delaunay triangulation, thus unique for a non-degenerate point set, while order-k Delaunay triangulations can be non-unique when k ≥ 1. In this work, we propose an algorithm to list all order-k Delaunay triangulations of a g...
متن کاملApproaches to High Aspect Ratio Triangulations
In aerospace computational uid dynamics calculations, high aspect ratio, or stretched, triangulations are often used to adequately resolve the features of a viscous ow around bodies. In this paper, we explore alternatives to the Delaunay triangulation which can be used to generate high aspect ratio triangulations of point sets. The method is based on a variation of the lifting map concept which...
متن کاملDense Point Sets Have Sparse Delaunay Triangulations ∗ or “ . . . But Not Too Nasty ” Jeff
The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay triangulation of any set of n points in R3 with spread ∆ has complexity O(∆3). This bound is tight in the worst case for all ∆ = O( √ n). In particular, the Delaunay triangulation of any dense point set has linear complexity. We also generalize this upper bound to re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1510.04608 شماره
صفحات -
تاریخ انتشار 2015